Representation of slim lattice by poset
نویسندگان
چکیده
In this paper, we present the necessary and sufficient conditions for a poset to be of union join meet irreducible elements slim lattice. Slim lattices are special finite that intensively investigated recently. The problem solved in paper is generalization proposed very recently by Cz?dli.
منابع مشابه
The Matrix of a Slim Semimodular Lattice
A finite lattice L is called slim if no three join-irreducible elements of L form an antichain. Slim semimodular lattices play the main role in G. Czédli and E.T. Schmidt [5], where lattice theory is applied to a purely group theoretical problem. Here we develop a unique matrix representation for these lattices.
متن کاملThe completion of a poset in a lattice of antichains
It is well known that given a poset, X, the lattice of order ideals of X, 〈I(X),⊆〉, is a completion of X via the order-embedding φ : X ↪→ I(X) where φ(x) = ↓x. Herein we define a lattice of antichains in X, 〈A(X),4〉, and prove it is isomorphic to 〈I(X),⊆〉. We establish the “join” and “meet” operations of the lattice, and present results for 〈A(X),4〉 analogous to standard results for 〈I(X),⊆〉, i...
متن کاملIncomparable Copies of a Poset in the Boolean Lattice
Let Bn be the poset generated by the subsets of [n] with the inclusion as relation and let P be a nite poset. We want to embed P into Bn as many times as possible such that the subsets in di erent copies are incomparable. The maximum number of such embeddings is asymptotically determined for all nite posets P as 1 t(P ) ( n bn/2c ) , where t(P ) denotes the minimal size of the convex hull of a ...
متن کاملPoset representation and similarity comparisons of systems in IR
Abstract. In this paper we are using the poset representation to describe the complex answers given by IR systems after a clustering and ranking processes. The answers considered may be given by cartographical representations or by thematic sub-lists of documents. The poset representation, with the graph theory and the relational representation opens many perspectives in the definition of new s...
متن کاملPoset representation and similarity comparisons os systems in IR
In this paper we are using the poset representation to describe the complex answers given by IR systems after a clustering and ranking processes. The answers considered may be given by cartographical representations or by thematic sub-lists of documents. The poset representation, with the graph theory and the relational representation opens many perspectives in the definition of new similarity ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2021
ISSN: ['2406-0933', '0354-5180']
DOI: https://doi.org/10.2298/fil2103919r